Container Routing in Multimodal and Time – Dependent Network Using Genetic Algorithms
نویسندگان
چکیده
This article deals with the intermodal transportation problem for the commodities delivery between different locations. The time – dependent shortest path planning, in which the travel time along each arc is a known function of the departure time along the arc, is a very important problem and arises in many practical application such as a routing system of a container used in the time – dependent intermodal transportation. Given a fixed timetable of the bi – intermodal transportation network (using trucks and trains ), this article proposes a genetic algorithm – based method to route a container from a source to destination such that the total transportation time between these nodes to be minimum.
منابع مشابه
A model for distribution centers location-routing problem on a multimodal transportation network with a meta-heuristic solving approach
Nowadays, organizations have to compete with different competitors in regional, national and international levels, so they have to improve their competition capabilities to survive against competitors. Undertaking activities on a global scale requires a proper distribution system which could take advantages of different transportation modes. Accordingly, the present paper addresses a location-r...
متن کاملMultimodal Transportation p-hub Location Routing Problem with Simultaneous Pick-ups and Deliveries
Centralizing and using proper transportation facilities cut down costs and traffic. Hub facilities concentrate on flows to cause economic advantage of scale and multimodal transportation helps use the advantage of another transporter. A distinctive feature of this paper is proposing a new mathematical formulation for a three-stage p-hub location routing problem with simultaneous pick-ups and de...
متن کاملOptimum Routing in the Urban Transportation Network by Integrating Genetic Meta-heuristic (GA) and Tabu Search (Ts) Algorithms
Urban transportation is one of the most important issues of urban life especially in big cities. Urban development, and subsequently the increase of routes and communications, make the role of transportation science more pronounced. The shortest path problem in a network is one of the most basic network analysis issues. In fact, finding answers to this question is necessity for higher level ana...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملA Hierarchy Topology Design Using a Hybrid Evolutionary Algorithm in Wireless Sensor Networks
Wireless sensor network a powerful network contains many wireless sensors with limited power resource, data processing, and transmission abilities. Wireless sensor capabilities including computational capacity, radio power, and memory capabilities are much limited. Moreover, to design a hierarchy topology, in addition to energy optimization, find an optimum clusters number and best location of ...
متن کامل